Computing with truly asynchronous threshold logic networks
نویسندگان
چکیده
منابع مشابه
Computing with Truly Asynchronous Threshold Logic Networks
We present simulation mechanisms by which any network of threshold logic units with either symmetric or asymmetric interunit connections (i.e., a symmetric or asymmetric \Hoppeld net") can be simulated on a network of the same type, but without any a priori constraints on the order of updates of the units. Together with earlier constructions, the results show that the truly asynchronous network...
متن کاملAsynchronous threshold networks
Let G = (V, E) be a graph with an initial sign s(v)e { _+ 1} for every vertex vs V. When a vertex v becomes active, it resets its sign to s'(v) which is the sign of the majority of its neighbors (s'(v) = 1 if there is a tie). G is in a stable state if s(v) = s'(v) for all v e V. We show that for every graph G = (V, E) and every initial signs, there is a sequence v~, v 2 ..... v, of vertices of ...
متن کاملTechnology Mapping for Robust Asynchronous Threshold Networks
As process, temperature and voltage variations become significant in deep submicron design, timing closure becomes a critical challenge in synchronous CAD flows. One attractive alternative is to use robust asynchronous circuits which gracefully accommodate timing discrepancies. However, there is currently little CAD support for such robust methodologies. In this paper, an algorithm for technolo...
متن کاملHysteretic Threshold Logic and Quasi-Delay Insensitive Asynchronous Design
We introduce the class of hysteretic linear-threshold (HLT) logic functions as a novel extension of linear threshold logic, and prove their general applicability for constructing state-holding Boolean functions. We then demonstrate a fusion of HLT logic with the quasi-delay insensitive style of asynchronous circuit design, complete with logical design examples. Future research directions are al...
متن کاملCOMPUTING SCIENCE Logic Decomposition of Asynchronous Circuits Using STG Unfoldings
A technique for logic decomposition of asynchronous circuits which works on STG unfolding prefixes rather than state graphs is proposed. It retains all the advantages of the state space based approach, such as the possibility of multiway acknowledgement, latch utilisation and highly optimised circuits. Moreover, it significantly alleviates the state space explosion, and thus has superior memory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00017-5